1965A - Everything Nim - CodeForces Solution


games greedy

Please click on ads to support us..

Python Code:

t = int(input())
for _ in range(t):
  n = int(input())
  an = list(map(int, input().split()))
  an.sort()
  maxsize = an[-1]
  mexsize = 1
  for sz in an:
    if sz == mexsize:
      mexsize += 1

  if mexsize > maxsize:
    print("Alice" if maxsize % 2 == 1 else "Bob")
  else:
    print("Alice" if mexsize % 2 == 1 else "Bob")


Comments

Submit
0 Comments
More Questions

507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort
1370C - Number Game
1206B - Make Product Equal One
131A - cAPS lOCK
1635A - Min Or Sum
474A - Keyboard
1343A - Candies
1343C - Alternating Subsequence
1325A - EhAb AnD gCd
746A - Compote
318A - Even Odds
550B - Preparing Olympiad
939B - Hamster Farm